Two Population-Based Heuristic Search Algorithms and Their Applications
نویسندگان
چکیده
Search is one of the most frequently used problem solving methods in artificial intelligence (AI) [1], and search methods are gaining interest with the increase in activities related to modeling complex systems [2, 3]. Since most practical applications involve objective functions which cannot be expressed in explicit mathematical forms and their derivatives cannot be easily computed, a better choice for these applications may be the direct search methods as defined below: A direct search method for numerical optimization is any algorithm that depends on the objective function only through ranking a countable set of function values. Direct search methods do not compute or approximate values of derivatives and remain popular because of their simplicity, flexibility, and reliability [4]. Among the direct search methods, hill climbing methods often suffer from local minima, ridges and plateaus. Hence, random restarts in search process can be used and are often helpful. However, high-dimensional continuous spaces are big places in which it is easy to get lost for random search. Resultantly, augmenting hill climbing with memory is applied and turns out to be effective [5]. In addition, for many real-world problems, an exhaustive search for solutions is not a practical proposition. It is common then to resort to some kind of heuristic approach as defined below: heuristic search algorithm for tackling optimization problems is any algorithm that applies a heuristic to search through promising solutions in order to find a good solution. This heuristic search allows the bypass of the “combinatorial explosion” problem [6]. Those techniques discussed above are all classified into heuristics involved with random move, population, memory and probability model [7]. Some of the best-known heuristic search methods are genetic algorithm (GA), tabu search and simulated annealing, etc.. A standard GA has two drawbacks: premature convergence and lack of good local search ability [8]. In order to overcome these disadvantages of GA in numerical optimization problems, differential evolution (DE) algorithm has been introduced by Storn and Price [9]. In the past 20 years, swarm intelligence computation [10] has been attracting more and more attention of researchers, and has a special connection with the evolution strategy and the genetic algorithm [11]. Swarm intelligence is an algorithm or a device and illumined by the social behavior of gregarious insects and other animals, which is designed for solving distributed problems. There is no central controller directing the behavior of the swarm; rather, these systems are self-organizing. This means that the complex and constructive collective behavior emerges from the individuals (agents) who follow some simple rules and
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملOPTIMAL SIZE AND GEOMETRY DESIGN OF TRUSS STRUCTURES UTILIZING SEVEN META-HEURISTIC ALGORITHMS: A COMPARATIVE STUDY
Meta-heuristic algorithms are applied in optimization problems in a variety of fields, including engineering, economics, and computer science. In this paper, seven population-based meta-heuristic algorithms are employed for size and geometry optimization of truss structures. These algorithms consist of the Artificial Bee Colony algorithm, Cyclical Parthenogenesis Algorithm, Cuckoo Search algori...
متن کاملModeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms
In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...
متن کاملFORECASTING TRANSPORT ENERGY DEMAND IN IRAN USING META-HEURISTIC ALGORITHMS
This paper presents application of an improved Harmony Search (HS) technique and Charged System Search algorithm (CSS) to estimate transport energy demand in Iran, based on socio-economic indicators. The models are developed in two forms (exponential and linear) and applied to forecast transport energy demand in Iran. These models are developed to estimate the future energy demands based on pop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012